Intersections with random geometric objects
نویسندگان
چکیده
We present a systematic study of the expected complexity of the intersection of geometric objects. We first study the expected size of the intersection between a random Voronoi diagram and a generic geometric object that consists of a finite collection of line segments in the plane. Using this result, we explore the intersection complexity of a random Voronoi diagram with the following target objects which may or may not be random: a line segment, a Voronoi diagram, a minimum spanning tree, a Gabriel graph, a relative neighborhood graph, a Hamiltonian circuit, a furthest point Voronoi diagram, a convex hull, a k-dimensional tree, and a rectangular grid. ¢ 1998 Elsevier Science B.V.
منابع مشابه
12 Discrete Aspects of Stochastic Geometry
Stochastic geometry studies randomly generated geometric objects. The present chapter deals with some discrete aspects of stochastic geometry. We describe work that has been done on familiar objects of discrete geometry, like finite point sets, their convex hulls, discrete point sets, arrangements of flats, tessellations of space, under various assumptions of randomness. Most of the results to ...
متن کاملIntersection Detection of Convex Polygons
Detecting whether two geometric objects intersect and computing the region of intersection are fundamental problems in computational geometry. Geometric intersection problems arise naturally in a number of applications. Examples include geometric packing and covering, wire and component layout in VLSI, map overlay in geographic information systems, motion planning, and collision detection. In s...
متن کامل13 Discrete Aspects of Stochastic Geometry
Stochastic geometry studies randomly generated geometric objects. The present chapter deals with some discrete aspects of stochastic geometry. We describe work that has been done on finite point sets, their convex hulls, infinite discrete point sets, arrangements of flats, and tessellations of space, under various assumptions of randomness. Typical results concern expectations of geometrically ...
متن کاملGeometric Motion Planning: Finding Intersections
We investigate a new model for mobile agents: Motion planning with geometric primitives, similar to rulerand-circle constructions in classical geometry. In this first paper on this subject, we consider finding intersection points between two geometric objects using mobile agents that move on these objects. This amounts to finding the rendezvous point of the two agents.
متن کاملA Fast Intersection Detection Algorithm for Qualitative Spatial Reasoning
In this paper we present a framework for determining the intersection of geometric objects based on the 9-Intersection model used in qualitative spatial reasoning. Triangle-triangle intersection is the computational basis for interaction between 2D/3D objects; hence a fast, robust intersection detection algorithm is beneficial. Additionally, we present efficient predicates for classification of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Comput. Geom.
دوره 10 شماره
صفحات -
تاریخ انتشار 1998